Finite automata on infinite objects
نویسنده
چکیده
Infinite behaviors of several kinds of finite automata on infinite objects are studied. Namely, alternating finite automata on r0-words, finite tree automata on infinite trees which move from the root infinitely, and finite biautomata on two-sided infinite words are investigated through six types of acceptance conditions. Each condition is an appropriate extension of the one used for acceptance of finite automata on co-words.
منابع مشابه
Three Lectures on Automatic Structures
This paper grew out of three tutorial lectures on automatic structures given at the Logic Colloquium 2007 in Wroc law (Poland). The paper will follow the outline of the tutorial lectures, supplementing some material along the way. We discuss variants of automatic structures related to several models of computation: word automata, tree automata, Büchi automata, and Rabin automata. Word automata ...
متن کاملAutomata and Algebras for Infinite Words and Trees
Regular languages can be studied not just for finite words, but also for finite trees, infinite words and infinite trees. Almost all of the theory of regular languages, such as closure under boolean operations, works also for these extensions, but the constructions are significantly more challenging and mathematically interesting. For instance, automata for infinite words can be determinised un...
متن کاملKevin Compton , Jean - Eric Pin , Wolfgang Thomas ( editors ) : Automata Theory : Infinite Computations
s of Talks Page I. Automata and Infinite Sequences 6 Ch. Frougny (Paris): Rational 0)-Relations, Application to the Representation of Real Numbers J. Karhuméiki (Turku): Finite Automata Computing Real Functions N. Klarlund (Aarhus): Progress Measures for Complementation of to-Automata B. Le Saec (Bordeaux): A Syntactic Approach to Deterministic to-Automata D. Perrin (Paris): to-Automata with Mu...
متن کاملComparing the power of advice strings: a notion of complexity for infinite words
We investigate in this paper a certain notion of comparison between infinite words. In a general way, if M is a model of computation (e.g. Turing machines) and C a class of objects (e.g. languages), the complexity of an infinite word α can be measured with respect to the objects from C that are presentable with machines from M using α as an oracle. In our case, the model M is finite automata an...
متن کاملThe Emptiness Problem for Automata on Infinite Trees
The purpose of this paper is to give an alternative proof to the decidability of the emptiness problem for tree automata, as shown in Rabin [4]. The proof reduces the emptiness problem for automata on infinite trees to that for automata on finite trees, by showing that any automata definable set of infinite trees must contain a finitelygenerable tree. Section 1: Introduction The analysis of fin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012